Flexible Strategy Use in Young Children ’ s Tic - Tat - Toe KEVIN CROWLEY

نویسندگان

  • KEVIN CROWLEY
  • ROBERT S. SIEGLER
چکیده

In domains with multiple competing goals, people face a basic challenge: How to make their strategy use flexible enough to deal with shifting circumstances without losing track of their overall objectives. This article examines how young children meet this challenge in one such domoin, tic-tot-toe. Experiment 1 provides an overview of development in the area: it indicates that children’s tic-tat-toe strotegies are rule based and that new rules ore added one at o time. Experiment 2 demonstrates that even young children flexibly tailor their strategy use to meet shifting circumstances. Experiment 3 indicates that these adaptations are accomplished through a process of goal-based resource allocation, whereby children focus their cognitive resources on opplying rules most consistent with their current primary goal. A computer simulation specifies how this process works and demonstrotes its sufficiency for producing behovior much like thot of the children. The findings ore discussed as part of a brooder framework of mechanisms for generating problem-solving approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1984 - Towards Chunking as a General Leaming Mechanism

Chunks have long been proposed as a basic organizational unit for human memory. More recently chunks have been used to model human learning on simple perceptual-motor skills. In this paper we describe recent progress in extending chunking to be a general learning mechanism by implementing it within a general problem solver. Using the Soar problem-solving architecture, we take significant steps ...

متن کامل

Norman Do How to Win at Tic - Tac - Toe

Undoubtedly one of the most popular pencil and paper games in the world is tic-tac-toe, also commonly known as noughts and crosses. The game has a longstanding history in many cultures across the globe. It has been posited that it may even have been played under the name of “terni lapilli” in Ancient Rome, where examples of the tic-tac-toe grid have been found etched in stone throughout the emp...

متن کامل

Constraint-Based Generalization: Learning Game-Playing Plans From Single Examples

Constraint-based Generalization is a technique for deducing generalizations from a single example. We show how this technique can be used for learning tactical combinations in games and discuss an implementation which learns forced wins in tic-tat-toe, go-moku, and chess.’

متن کامل

A Pairing Strategy for Tic-Tac-Toe on the Integer Lattice with Numerous Directions

We consider a tic-tac-toe game played on the d-dimensional integer lattice. The game that we investigate is a Maker–Breaker version of tic-tac-toe. In a Maker– Breaker game, the first player, Maker, only tries to occupy a winning line and the second player, Breaker, only tries to stop Maker from occupying a winning line. We consider the bounded number of directions game, in which we designate a...

متن کامل

Game-Theoretic Techniques

Game trees are extensively used in the artificial intelligence field, especially in game-playing problems. Consider a computer that plays a game of tic-tac-toe against a user. At the root of the game tree is an tic-tac-toe grid with the computer’s first move marked in (we assume the computer always goes first with the same first move). This root has eight children, corresponding to the eight di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003